- cellular automata machine
- клеточно-автоматная вычислительная машина
English-Russian dictionary of computer science and programming. 2013.
English-Russian dictionary of computer science and programming. 2013.
Garden of Eden (cellular automata) — In a cellular automaton, a Garden of Eden configuration is a configuration which cannot appear on the lattice after one time step, no matter what the initial configuration. In other words, these are the configurations with no predecessors.They… … Wikipedia
Cellular neural network — Cellular neural networks (CNN) are a parallel computing paradigm similar to neural networks, with the difference that communication is allowed between neighbouring units only. Typical applications include image processing, analyzing 3D surfaces,… … Wikipedia
Automata — may refer to * Automata theory, in theoretical computer science, the study of abstract machines * The plural form of Automaton, a self operating machine. * Cellular Automata, a model of computation that is the basic design behind a broad class of … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states … Wikipedia
Machine de Von Neumann — Constructeur universel Le constructeur universel est une structure autoréplicante au sein d un automate cellulaire, tous deux créés par John von Neumann dans les années 1940[1]. Sommaire 1 Description 2 Interprétation … Wikipédia en Français
Garden of Eden (cellular automaton) — An orphan pattern in Conway s Game of Life, discovered by R. Banks in 1971.[1] … Wikipedia
Self-replicating machine — A self replicating machine is an artificial construct that is theoretically capable of autonomously manufacturing a copy of itself using raw materials taken from its environment. The concept of self replicating machines has been advanced and… … Wikipedia
Codd's cellular automaton — A simple configuration in Codd s cellular automaton. Signals pass along wire made of cells in state 1 (blue) sheathed by cells in state 2 (red). Two signal trains circulate around a loop and are duplicated at a T junction onto an open ended… … Wikipedia
Majority problem (cellular automaton) — The majority problem, or density classification task is the problem of finding one dimensional cellular automaton rules that accurately perform majority voting. Using local transition rules, cells cannot know the total count of all the ones in… … Wikipedia
Von Neumann cellular automaton — Von Neumann cellular automata are the original expression of cellular automata, the development of which were prompted by suggestions made to John von Neumann by his close friend and fellow mathematician Stanisław Ulam. Their original purpose was … Wikipedia